An Algorithm for Computing the Convex Hull of a Set of Imprecise Line Segment Intersection
نویسندگان
چکیده
Data imprecision constitutes an important gap between theory and practice in computational geometry. A lot of research about imprecision in computational geometry is directed at computing the convex hull of imprecise points rather than imprecise line segment intersection. In this paper we introduce an algorithm to construct the convex hull for a set of imprecise line segment intersection in time.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملNew Algorithms for Computing Maximum Perimeter and Maximum Area of the Convex Hull of Imprecise Inputs Based On the Parallel Line Segment Model
In this paper, we present new algorithms for computing maximum perimeter and maximum area of the convex hull of imprecise inputs based on the parallel line segment model. The running time of our algorithms for maximum perimeter problem is O(n) which improve over the previous results of O(n) in [12]. For maximum are problem with different size of parallel line segments [12] gives O(n) algorithms...
متن کاملApproximating Largest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point will lie. Such a region can be modelled as a circle, square, line segment, etc. We study the problem of maximising the area of the convex hull of such a set. We prove NP-hardness when the imprecise points are modelled as line segments, and give linear time approximation schemes for a var...
متن کاملCapturing Crossings: Convex Hulls of Segment and Plane Intersections
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n)) intersection points in an arrangement of n line segments in the plane. We also show an arrangement of dn planes in d-dimensions whose arrangement has Θ(nd−1) intersection points on the convex hull.
متن کاملRandomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
We show that the well-known random incremental construction of Clarkson and Shor can be adapted to provide efficient external-memory algorithms for some geometric problems. In particular, as the main result, we obtain an optimal randomized algorithm for the problem of computing the trapezoidal decomposition determined by a set of N line segments in the plane with K pairwise intersections, that ...
متن کامل